//ॐ नमः शिवाय
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
std::ios_base ::sync_with_stdio(false);
std::cin.tie(NULL);
std::cout.tie(NULL);
int T;
//T=1;
std::cin>>T;
for (int i1 = 1; i1 <= T;i1++)
{
int n,m;
cin>>n>>m;
m+=1;
int ans=0;
for(int i=32;i>=0;i--){
int bit1=n&(1LL<<i),bit2=m&(1LL<<i);
if(bit1 && !bit2){
break;
}
else if(!bit1 && bit2){
ans+=(1LL<<i);
}
}
cout<<ans<<endl;
}
return 0;
}
1535A - Fair Playoff | 1538F - Interesting Function |
1920. Build Array from Permutation | 494. Target Sum |
797. All Paths From Source to Target | 1547B - Alphabetical Strings |
1550A - Find The Array | 118B - Present from Lena |
27A - Next Test | 785. Is Graph Bipartite |
90. Subsets II | 1560A - Dislike of Threes |
36. Valid Sudoku | 557. Reverse Words in a String III |
566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |
387. First Unique Character in a String | 383. Ransom Note |
242. Valid Anagram | 141. Linked List Cycle |
21. Merge Two Sorted Lists | 203. Remove Linked List Elements |
733. Flood Fill | 206. Reverse Linked List |
83. Remove Duplicates from Sorted List | 116. Populating Next Right Pointers in Each Node |
145. Binary Tree Postorder Traversal | 94. Binary Tree Inorder Traversal |
101. Symmetric Tree | 77. Combinations |